Byzantine Failure Detection for Dynamic Distributed Systems

Byzantine failure detectors provide an elegant abstraction for implementing Byzantine fault tolerance. However, as far as we know, there is no general solution for this problem in a dynamic distributed system over wireless networks with unknown membership. This paper presents thus a rst Byzantine failure detector for this context. The protocol has the interesting feature to be time-free, that is, it does not rely on timers to detect omission failures. This characteristic favors its scalability and help to deal with the dynamics and unpredictability of those networks. Key-words: failure detectors, Byzantine failures, dynamic distributed systems, wireless networks, self-organizing systems ∗ DCC Computer Science Department / Federal University of Bahia † LIP6 University of Paris 6 INRIA CNRS in ria -0 04 61 51 8, v er si on 2 8 Ap r 2 01 1 Détection des fautes byzantines pour les systèmes